A Small Improvement in the Walking Algorithm for Point Location in a Triangulation
نویسنده
چکیده
The paper shows a simple technique which saves some edge tests in the walking algorithm for point location. The walking technique does not achieve the logarithmic per point complexity of the location-datastructure-based methods but does not need any auxiliary data structure and is very simple to implement, therefore, it is very popular in practice. The suggested idea did not bring a substantial improvement in our tests but it is very simple and there is an open door to further more substantial improvement in the future research.
منابع مشابه
Using the Modified Shuffled Frog Leaping Algorithm for Optimal Sizing and location of Distributed Generation Resources for Reliability Improvement
Restructuring the recent developments in the power system and problems arising from construction as well as the maintenance of large power plants lead to increase in using the Distributed Generation (DG) resources. DG units due to its specifications, technology and location network connectivity can improve system and load point reliability indices. In this paper, the allocation and sizing of di...
متن کاملThe Delaunay Hierarchy
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small memory occupation and the possibility of fully dynamic insertions and deletions. The location structure is organized into several levels. The lowest level just consists of the triangulation, then each level contains the ...
متن کاملStabilization and Walking Control for a Simple Passive Walker Using Computed Torque Method (RESEARCH NOTE)
Abstract The simple passive dynamic walker can walk down a shallow downhill slope with no external control or energy input. Nevertheless, the period-one gait stability is only possible over a very narrow range of slopes. Since the passive gaits are extremely sensitive to slope angles, it is important to use a control strategy in order to achieve a wide range of stable walking. The computed to...
متن کاملWalking Faster in a Triangulation
Point location in a triangulation is one of the most studied problems in computational geometry. For a single query, stochastic walk is a good practical strategy. In this work, we propose two approaches improving the performance of the stochastic walk. The first improvement is based on a relaxation of the exactness of the predicate, whereas the second is based on termination guessing. Key-words...
متن کاملA Hybrid Algorithm for Optimal Location and Sizing of Capacitors in the presence of Different Load Models in Distribution Network
In practical situations, distribution network loads are the mixtures of residential, industrial, and commercial types. This paper presents a hybrid optimization algorithm for the optimal placement of shunt capacitor banks in radial distribution networks in the presence of different voltage-dependent load models. The algorithm is based on the combination of Genetic Algorithm (GA) and Binary Part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006